An Efficient Method for Finding Similar Regions in a 2-Dimensional Array Data
نویسندگان
چکیده
منابع مشابه
A method for 2-dimensional inversion of gravity data
Applying 2D algorithms for inverting the potential field data is more useful and efficient than their 3D counterparts, whenever the geologic situation permits. This is because the computation time is less and modeling the subsurface is easier. In this paper we present a 2D inversion algorithm for interpreting gravity data by employing a set of constraints including minimum distance, smoothness,...
متن کاملa method for 2-dimensional inversion of gravity data
applying 2d algorithms for inverting the potential field data is more useful and efficient than their 3d counterparts, whenever the geologic situation permits. this is because the computation time is less and modeling the subsurface is easier. in this paper we present a 2d inversion algorithm for interpreting gravity data by employing a set of constraints including minimum distance, smoothness,...
متن کاملAn Efficient Method for Finding Closed Subspace Clusters for High Dimensional Data
Subspace clustering tries to find groups of similar objects from the given dataset such that the objects are projected on only a subset of the feature space. It finds meaningful clusters in all possible subspaces. However, when it comes to the quality of the resultant subspace clusters most of the subspace clusters are redundant. These redundant subspace clusters don’t provide new information. ...
متن کاملThe Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems
In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...
متن کاملFinding Similar Regions in Many Sequences
1 1 Some of the results in this paper have appeared as a part of an extended abstract presented in ''Proc. Algorithms for finding similar, or highly conserved, regions in a group of sequences are at the core of many molecular biology problems. Assume that we are given n DNA sequences s 1 , ..., s n. The Consensus Patterns problem, which has been widely studied in bioinformatics research, in its...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KIPS Transactions on Software and Data Engineering
سال: 2017
ISSN: 2287-5905
DOI: 10.3745/ktsde.2017.6.4.185